- admissible substitution
- допустимая замена
The New English-Russian Dictionary of Radio-electronics. F.V Lisovsky . 2005.
The New English-Russian Dictionary of Radio-electronics. F.V Lisovsky . 2005.
Admissible rule — In logic, a rule of inference is admissible in a formal system if the set of theorems of the system is closed under the rule. The concept of an admissible rule was introduced by Paul Lorenzen (1955).DefinitionsThe concept of admissibility, as… … Wikipedia
RÉCURSIVITÉ — Les (semi ) fonctions récursives ont été introduites pour donner un équivalent mathématique à la notion métamathématique intuitive de (semi ) fonction effectivement ou mécaniquement calculable (cf. LOGIQUE MATHÉMATIQUE, chap. 4). Par souci de… … Encyclopédie Universelle
Unification (computer science) — Unification, in computer science and logic, is an algorithmic process by which one attempts to solve the satisfiability problem. The goal of unification is to find a substitution which demonstrates that two seemingly different terms are in fact… … Wikipedia
General frame — In logic, general frames (or simply frames) are Kripke frames with an additional structure, which are used to model modal and intermediate logics. The general frame semantics combines the main virtues of Kripke semantics and algebraic semantics:… … Wikipedia
Sacrifice — • This term is identical with the English offering (Latin offerre) and the German Opfer Catholic Encyclopedia. Kevin Knight. 2006. Sacrifice Sacrifice … Catholic encyclopedia
South African contract law — is essentially a modernised version of the Roman Dutch law of contract, [1] which is itself rooted in Roman law. In the broadest definition, a contract is an agreement entered into by two or more parties with the serious intention of creating a… … Wikipedia
Logicism — is one of the schools of thought in the philosophy of mathematics, putting forth the theory that mathematics is an extension of logic and therefore some or all mathematics is reducible to logic.[1] Bertrand Russell and Alfred North Whitehead… … Wikipedia
Unification — In mathematical logic, in particular as applied to computer science, a unification of two terms is a join (in the lattice sense) with respect to a specialisation order. That is, we suppose a preorder on a set of terms, for which t * ≤ t means… … Wikipedia
Bisphénol A — Structure du bisphénol A Général … Wikipédia en Français
Acide sulfurique — Pour les articles homonymes, voir Acide sulfurique (homonymie). Acide Sulfurique … Wikipédia en Français
Sharia — Not to be confused with Shahriyār. This article is part of the series … Wikipedia